Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Théorie apprentissage")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 96

  • Page / 4
Export

Selection :

  • and

An introduction to some statistical aspects of PAC learning theoryVIDYASAGAR, M.Systems & control letters. 1998, Vol 34, Num 3, pp 115-124, issn 0167-6911Article

Mathematics based on learningHAYASHI, Susumu.Lecture notes in computer science. 2002, pp 7-21, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

Learning theoryBARTLETT, P. L; VIDYASAGAR, M.Systems & control letters. 1998, Vol 34, Num 3, issn 0167-6911, 47 p.Serial Issue

Learning, logic, and topology in a common frameworkMARTIN, Eric; SHARMA, Arun; STEPHAN, Prank et al.Lecture notes in computer science. 2002, pp 248-262, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

Learning multiple languages in groupsJAIN, Sanjay; KINBER, Efim.Theoretical computer science. 2007, Vol 387, Num 1, pp 67-76, issn 0304-3975, 10 p.Conference Paper

Learning intersection-closed classes with signaturesBULATOV, Andrei; HUBIE CHEN; DALMAU, Victor et al.Theoretical computer science. 2007, Vol 382, Num 3, pp 209-220, issn 0304-3975, 12 p.Conference Paper

Learning in parallelVITTER, J. S; JYH-HAN LIN.Information and computation (Print). 1992, Vol 96, Num 2, pp 179-202, issn 0890-5401Article

How rich is the structure of the intrinsic complexity of learningAMBAINIS, A.Information processing letters. 2000, Vol 75, Num 3, pp 109-112, issn 0020-0190Article

Learning dynamical systems in a stationary environmentCAMPI, M. C; KUMAR, P. R.Systems & control letters. 1998, Vol 34, Num 3, pp 125-132, issn 0167-6911Article

A learning result for continuous-time recurrent neural networksSONTAG, E. D.Systems & control letters. 1998, Vol 34, Num 3, pp 151-158, issn 0167-6911Article

Theory and practice of vector quantizers trained on small training setsCOHN, D; RISKIN, E. A; LADNER, R et al.IEEE transactions on pattern analysis and machine intelligence. 1994, Vol 16, Num 1, pp 54-65, issn 0162-8828Article

Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapsesKLIVANS, Adam R; VAN MELKEBEEK, Dieter.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1501-1526, issn 0097-5397, 26 p.Article

Identification and adaptive control : Towards a complexity-based general theoryZAMES, G.Systems & control letters. 1998, Vol 34, Num 3, pp 141-149, issn 0167-6911Article

Learning attribute-efficiently with corrupt oraclesBENNET, Rotem; BSHOUTY, Nader H.Theoretical computer science. 2007, Vol 387, Num 1, pp 32-50, issn 0304-3975, 19 p.Conference Paper

Discriminative leaming can succeed where generative leaming failsLONG, Philip M; SERVEDIO, Rocco A; SIMON, Hans Ulrich et al.Information processing letters. 2007, Vol 103, Num 4, pp 131-135, issn 0020-0190, 5 p.Article

LEARNING KERNEL-BASED HALFSPACES WITH THE 0-1 LOSSSHALEV-SHWARTZ, Shai; SHAMIR, Ohad; SRIDHARAN, Karthik et al.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1623-1646, issn 0097-5397, 24 p.Article

Pattern classification with missing data: a reviewGARCIA-LAENCINA, Pedro J; SANCHO-GOMEZ, José-Luis; FIGUEIRAS-VIDAL, Aníbal R et al.Neural computing & applications (Print). 2010, Vol 19, Num 2, pp 263-282, issn 0941-0643, 20 p.Article

Learning recursive functions : A surveyZEUGMANN, Thomas; ZILLES, Sandra.Theoretical computer science. 2008, Vol 397, Num 1-3, pp 4-56, issn 0304-3975, 53 p.Article

An approach to intrinsic complexity of uniform learningZILLES, Sandra.Theoretical computer science. 2006, Vol 364, Num 1, pp 42-61, issn 0304-3975, 20 p.Conference Paper

A connectionist computational model for epistemic and temporal reasoningD'AVILA GARCEZ, Artur S; LAMB, Lufs C.Neural computation. 2006, Vol 18, Num 7, pp 1711-1738, issn 0899-7667, 28 p.Article

Inductive inference of approximations for recursive conceptsLANGE, Steffen; GRIESER, Gunter; ZEUGMANN, Thomas et al.Theoretical computer science. 2005, Vol 348, Num 1, pp 15-40, issn 0304-3975, 26 p.Conference Paper

On PAC learning algorithms for rich Boolean function classesHELLERSTEIN, Lisa; SERVEDIO, Rocco A.Theoretical computer science. 2007, Vol 384, Num 1, pp 66-76, issn 0304-3975, 11 p.Conference Paper

Parallelism increases iterative learning powerCASE, John; MOELIUS, Samuel E.Theoretical computer science. 2009, Vol 410, Num 19, pp 1863-1875, issn 0304-3975, 13 p.Article

THE SIGN-RANK OF AC°RAZBOROV, Alexander A; SHERSTOV, Alexander A.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1833-1855, issn 0097-5397, 23 p.Article

Window-Based Example Selection in Learning Vector QuantizationWITOELAR, A. W; GHOSH, A; DE VRIES, J. J. G et al.Neural computation. 2010, Vol 22, Num 11, pp 2924-2961, issn 0899-7667, 38 p.Article

  • Page / 4